Optimality of Bernstein Representations for Computational Purposes

In this article, optimal properties of the Bernstein basis of polynomials are revisited. In particular, these include optimal shape preserving properties and optimal stability for the evaluation in computer aided geometric design, minimal conditioning of its collocation matrices and fastest convergence rates of the corresponding iteration approximation property. Recent advances on stable evaluation algorithms for this basis will be also presented and discussed.